Weak typed Böhm theorem on IMLL
نویسندگان
چکیده
منابع مشابه
Weak Typed Boehm Theorem on IMLL
In the Böhm theorem workshop on Crete island, Zoran Petric called Statman’s “Typical Ambiguity theorem” typed Böhm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment ...
متن کاملWeak Typed Böhm Theorem on IMLL
In the Böhm theorem workshop on Crete island, Zoran Petric called Statman’s “Typical Ambiguity theorem” typed Böhm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment ...
متن کاملThe Böhm-Jacopini Theorem Is False, Propositionally
The Böhm–Jacopini theorem (Böhm and Jacopini, 1966) is a classical result of program schematology. It states that any deterministic flowchart program is equivalent to a while program. The theorem is usually formulated at the first-order interpreted or first-order uninterpreted (schematic) level, because the construction requires the introduction of auxiliary variables. Ashcroft and Manna (1972)...
متن کاملËì - Calculus and Böhm ’ S Theorem
The-calculus is an extension of the-calculus that has been introduced by M Parigot to give an algorithmic content to classical proofs. We show that B ¨ ohm's theorem fails in this calculus. §1. Introduction. The-calculus (its typed and untyped versions) has been introduced by M. Parigot in [6]. Its typed version is an extension of the typed-calculus intended to give an algorithmic content to cl...
متن کاملA Proof of Weak Termination of Typed
We show that reducing any simply-typed-term (resp. *) by applying the rules in (resp. *) eagerly always terminates, by a translation to the simply-typed-calculus. This holds even with term and substitution meta-variables. In fact, every reduction terminates provided that ()-redexes are only contracted under so-called safe contexts; and in , resp. *-normal forms, all contexts around terms of sor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2007
ISSN: 0168-0072
DOI: 10.1016/j.apal.2006.06.001